Consider the shift map defined by (xy)↦(0x)
On the basis, this map's action gives a string e1↦e2↦0
Example 17.1
A linear function n^:C4→C4 whose action on E4 is given by the string e1↦e2↦e3↦e4↦0
has R(n^)∩N(n^)=[{e4}], R(n^2)∩N(n^2)=[{e3,e4}], and R(n^3)∩N(n^3)=[{e2,e3,e4}]
The matrix representation is N^=RepE4,E4(n^)=⎝⎜⎜⎜⎛0100001000010000⎠⎟⎟⎟⎞
None of n^,n^2,n^3 are the zero map, but n^4 is
Example 17.2
Transformations can also act on two strings. The transformation t acting on the basis B=⟨β1,...,β5⟩ by β1↦β2↦β3↦0β4↦β5↦0
has, for example, β3 in the intersection of the range space and null space.
The matrix representation is RepB,B(t)=⎝⎜⎜⎜⎜⎜⎛0100000100000000000100000⎠⎟⎟⎟⎟⎟⎞
A nilpotent transformation is one with a power that is the zero map, and a nilpotent matrix is similar. In either case, the least such power is the index of nilpotency
Example 16.1 has an index of nilpotency of 4
Example 16.2 has an index of nilpotency of 3
The derivative map d/dx:P2→P2 has index of nilpotency of 3 since taking the derivative of any quadratic three times makes it 0
The subdiagonal in a matrix is the array formed by the entries just below the diagonal (shown in red) ⎝⎜⎛010001000⎠⎟⎞
Since the zero matrix is only similar to itself, any matrix similar to a nilpotent matrix is also nilpotent.
Example 17.3
With the matrix N^=⎝⎜⎜⎜⎛0100001000010000⎠⎟⎟⎟⎞ and the four-vector basis D=⟨⎝⎜⎜⎜⎛1010⎠⎟⎟⎟⎞,⎝⎜⎜⎜⎛0210⎠⎟⎟⎟⎞,⎝⎜⎜⎜⎛1110⎠⎟⎟⎟⎞,⎝⎜⎜⎜⎛0001⎠⎟⎟⎟⎞⟩
a change of basis operation produces this representation with respect to D,D ⎝⎜⎜⎜⎛1010021011100001⎠⎟⎟⎟⎞⎝⎜⎜⎜⎛0100001000010000⎠⎟⎟⎟⎞⎝⎜⎜⎜⎛1010021011100001⎠⎟⎟⎟⎞−1=⎝⎜⎜⎜⎛−1−3−220−2−11153−20000⎠⎟⎟⎟⎞
This new matrix is nilpotent with index of nilpotency 4
Let t be a nilpotent transformation on V. A t-string generated by v∈V is a sequence ⟨v,t(v),...,tk−1(v)⟩ such that tk(v)=0. A t-string basis is a basis that is a concatenation of t-strings (which can only happen if they are disjoint)
Example 17.4
This he linear map t:C3→C3 ⎝⎜⎛xyz⎠⎟⎞t⎝⎜⎛yz0⎠⎟⎞
is nilpotent with index 3. A t-string is ⟨⎝⎜⎛001⎠⎟⎞,⎝⎜⎛010⎠⎟⎞,⎝⎜⎛100⎠⎟⎞⟩
and is also a t-string basis for the space C3
For Example 16.2, the two strings can be concatenated to form a basis ⟨β1,β2,β3,β4,β5⟩ for the domain C5 of t
If a space has a t-string basis then the index of nilpotency of t equals the length of the longest string in that basis.
Any nilpotent transformation t is associated with a t-string basis. While it is not unique, the number and length of the strings is determined by t
As a result, every matrix is similar to one that is all zeroes except for blocks of subdiagonal ones; it is represented by such matrix for some basis
If there are two such matrices, then they're just in a different order -> call the one with blocks in longest to shortest the canonical form
Example 17.5
The matrix M=(11−1−1)
has index of nilpotency of 2. This is a dimension two matrix, the space the transformation is applied to is dimension 2. The null space of one application of this transformation has dimension 1, and the null space of two applications has dimension 2. Thus, the action of this transformation on a string basis is β1→β2→0, making the canonical form N=(0100)
So, choosing β2∈N(m) and β1 such that m(β1)=β2, for example β2=(11)β1=(10)
shows that the canonical form is RepB,B(m)=PMP−1, where P−1=RepB,B(id)=(1011)P=(P−1)−1=(10−11)
We can check that indeed (10−11)(11−1−1)(1011)=(0100)
Example 17.6
Consider the matrix N=⎝⎜⎜⎜⎜⎜⎛01−101001100010−100−1010010−1⎠⎟⎟⎟⎟⎟⎞
From this chart
we see that after one application the null space has dimension 2, so 2 basis vectors map directly to zero. The nullity after 2 applications is 4, so two more basis vectors map to zero after 2 iterations. The nullity after 3 applications is 5, so the last remaining vector maps to zero after 3 iterations. β1↦β2↦β3↦0β4↦β5↦0
To produce such a basis, first pick two vectors from N(n) that form a linearly independent set β3=⎝⎜⎜⎜⎜⎜⎛00110⎠⎟⎟⎟⎟⎟⎞β5=⎝⎜⎜⎜⎜⎜⎛00011⎠⎟⎟⎟⎟⎟⎞
Then, we find two vectors β2,β4∈N(n2) such that n(β2)=β3 and n(β4)=β5 β2=⎝⎜⎜⎜⎜⎜⎛01000⎠⎟⎟⎟⎟⎟⎞β4=⎝⎜⎜⎜⎜⎜⎛01010⎠⎟⎟⎟⎟⎟⎞
Finally, find vector β1∈N(n3) such that n(β1)=β2
Jordan Canonical Form
We have given canonical forms for nilpotent and diagonalizable matrices. We now look for canonical forms for more general matrices.
We will show that any linear transformation t can be represented by a map RepB,B(t) under basis B such that it is the sum of a diagonal matrix and a nilpotent matrix.
First: a linear transformation on a nontrivial vector space is nilpotent iff its only eigenvalue is zero.
Proof
If the transformation t on a nontrivial vector space is nilpotent, then some tn is 0. Thus, t is a root of the polynomial p(x)=xn. Since p(t)=0, we must have p(λ)=0 for every eigenvalue λ of t. Since p(λ)=λn, the only eigenvalue of t is zero.
Conversely, if the only eigenvalue of an n-dimensional vector space t is 0, then its characteristic polynomial is (−1)nxn. By the Cayley-Hamilton Theorem, t satisfies its characteristic polynomial so tn=0, thus t is nilpotent.
The "nontrivial vector space" is important because a trivial vector space would have no eigenvalues since it has no associated nonzero eigenvectors.
The transformation t−λ idV is nilpotent iff t's only eignevalue is λ.
Proof
The transformation is nilpotent iff t−λidV's only eigenvalue is 0. But that holds iff t(v)=λv, which is true iff (t−λ idV)(v)=0⋅v
If the matrices T−λI and N are similar, then T and N+λI are also similar via the same change of basis matrices.
Proof
We have N=P(T−λI)P−1=PTP−1−P(λI)P−1=PTP−1−λPIP−1=PTP−1−λ. Rearranging gives N+λI=PTP−1
Since nilpotent matrices, which have a single eigenvalue of 0 are similar to the canonical form matrix consisting of all zeroes except blocks of subdiagonal ones, this can be extended to any matrix with a single eigenvalue of λ, in which case all the entries are λ.
Example 17.7
Find the canonical form of the matrix T=(21−14)
The characteristic polynomial of T is (x−3)2, so 3 is the only eigenvalue. Thus, T−3I has a unique eigenvalue of 0, making it nilpotent. To find the canonial form, we find the string basis for T−3I
power p
(T−3I)p
N((T−3I)p)
1
(−11−11)
{(−yy)∣y∈C}
2
(0000)
{(xy)∣x,y∈C}
So the nullspace of t−3id has dimension 1 and (t−3id)2 has dimension 2, making the string basis Bβ1↦β2↦0, giving the canonical form RepB,B(t−3id)=N=(0100)
To find such a basis B, we look for a β2 that is in the nullspace of t−3id and a β1 that is in the nullspace of (t−3id)2. Note that they must form a linearly independent set.
One such basis is β1=(11)β2=(1−1)
So we can conclude T is similar to N+3I=(3103)
A Jordan block is a square matrix, or square block of entries within a matrix, that is all zero except every diagonal entry is some λ∈C and every subdiagonal entry is 1.
The strings in the associated basis are Jordan strings or Jordan chains.
The previous examples show that for single-eigenvalue matrices, the Jordan block matrices are the canonical representations of the similarity class. We can make this matrix form unique by arranging the basis elements so that the block of subdiagonal ones go from longest to shortest from left to righ.
Example 17.8
There are three similarity classes for 3×3 matrices with unique eigenvalue 2: ⎝⎜⎛200020002⎠⎟⎞⎝⎜⎛210020002⎠⎟⎞⎝⎜⎛210021002⎠⎟⎞
Of these, the matrix ⎝⎜⎛200021002⎠⎟⎞
belongs to the middle similarity class due to the convention mentioned above.
Any transformation t:Cn→Cn can be represented in Jordan form, where each Jλ is a Jordan block ⎝⎜⎜⎜⎜⎜⎜⎜⎛Jλ1Jλ2−zeroes−⋱−zeroes−Jλn⎠⎟⎟⎟⎟⎟⎟⎟⎞
Example 17.9
This matrix with eigenvalues 3, 2, and 1, ⎝⎜⎜⎜⎜⎜⎜⎜⎛31000003000000300000021000002000000−1⎠⎟⎟⎟⎟⎟⎟⎟⎞
has four Jordan blocks: two associated with the eigenvalue 3, and one each with eigenvalues 2 and −1. The associated string representations are β1t−3idβ2t−3id0β3t−3id0β4t−2idβ5t−2id0β6t+1id0